A Modified Benders Decomposition Algorithm to Solve Second-Order Cone AC Optimal Power Flow
نویسندگان
چکیده
منابع مشابه
Benders decomposition algorithm for a green closed-loop supply chain under a build-to-order environment
Nowadays, researches pay more attention to environmental concerns consisted of various communities. This study proposes a multi-echelon, multi-period closed-loop supply chain (CLSC). A comprehensive model considers the selection of selection of technology and environmental effects. The supply chain is under a build-to-order (BTO) environment. So, there is not a final product inventory. Also, th...
متن کاملA Benders Decomposition Method to Solve an Integrated Logistics Network Designing Problem with Multiple Capacities
In this paper, a new model is proposed for the integrated logistics network designing problem. In many research papers in this area, it is assumed that there is only one option for the capacity of each facility in the network. However, this is not a realistic assumption because generally there may be many possible options for the capacity of the facility that is being established. Usually the c...
متن کاملA Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration
In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...
متن کاملBenders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty
Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Smart Grid
سال: 2019
ISSN: 1949-3053,1949-3061
DOI: 10.1109/tsg.2017.2776407